Ela Euclidean and Circum-euclidean Distance Matrices: Characterizations and Linear Preservers

نویسنده

  • MICHAEL W. TROSSET
چکیده

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euclidean and circum-Euclidean distance matrices: Characterizations and linear preservers

Short proofs are given to various characterizations of the (circum-)Euclidean squared distance matrices. Linear preserver problems related to these matrices are discussed.

متن کامل

Ela Block Distance Matrices

In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by D ij = F ii +F jj −2F ij. When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interes...

متن کامل

Special Bertrand Curves in semi-Euclidean space E4^2 and their Characterizations

In [14] Matsuda and Yorozu.explained that there is no special Bertrand curves in Eⁿ and they new kind of Bertrand curves called (1,3)-type Bertrand curves Euclidean space. In this paper , by using the similar methods given by Matsuda and Yorozu [14], we obtain that bitorsion of the quaternionic curve is not equal to zero in semi-Euclidean space E4^2. Obtain (N,B2) type quaternionic Bertrand cur...

متن کامل

Coordinate Shadows of Semidefinite and Euclidean Distance Matrices

We consider the projected semi-definite and Euclidean distance cones onto a subset of the matrix entries. These two sets are precisely the input data defining feasible semi-definite and Euclidean distance completion problems. We classify when these sets are closed, and use the boundary structure of these two sets to elucidate the Krislock-Wolkowicz facial reduction algorithm. In particular, we ...

متن کامل

Ela on Euclidean Distance Matrices of Graphs

Received by the editors on November 13, 2011. Accepted for publication on July 8, 2013. Handling Editor: Bryan L. Shader. FMF and IMFM, University of Ljubljana, Jadranska 19, 1000 Ljubljana, Slovenia, and IAM, University of Primorska, Slovenia ([email protected]). XLAB d.o.o., Pot za Brdom 100, 1125 Ljubljana, Slovenia, and FMF, University of Ljubljana, Slovenia ([email protected]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010